Hermite matrix in Lagrange basis for scaling static output feedback polynomial matrix inequalities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hermite matrix in Lagrange basis for scaling static output feedback polynomial matrix inequalities

Using Hermite’s formulation of polynomial stability conditions, static output feedback (SOF) controller design can be formulated as a polynomial matrix inequality (PMI), a (generally nonconvex) nonlinear semidefinite programming problem that can be solved (locally) with PENNON, an implementation of a penalty method. Typically, Hermite SOF PMI problems are badly scaled and experiments reveal tha...

متن کامل

On the NP hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback

In this paper, it is shown that the problem of checking the solvability of a bilinear matrix inequality (BMI), is NP-hard. A matrix valued function, F ( X , Y ) , is called bilinear if it is linear with respect to each of its arguments, and an inequality of the form, F ( X , Y ) > 0 is called a bilinear matrix inequality. Recently, it was shown that, the static output feedback problem, fixed or...

متن کامل

Polynomial Matrices, Lmis and Static Output Feedback

In the polynomial approach to systems control, the static output feedback problem can be formulated as follows: given two polynomial matrices D(s) and N(s), nd a constant matrix K such that polynomial matrix D(s) + KN(s) is stable. In this paper, we show that solving this problem amounts to solving a linear matrix inequality with a non-convex rank constraint. Several numerical experiments illus...

متن کامل

Linearization of Lagrange and Hermite interpolating matrix polynomials

This paper considers interpolating matrix polynomials P (λ) in Lagrange and Hermite bases. A classical approach to investigate the polynomial eigenvalue problem P (λ)x = 0 is linearization, by which the polynomial is converted into a larger matrix pencil with the same eigenvalues. Since the current linearizations of degree n Lagrange polynomials consist of matrix pencils with n + 2 blocks, they...

متن کامل

On a Generalized Companion Matrix Pencil for Matrix Polynomials Expressed in the Lagrange Basis

Abstract. Experimental observations of univariate rootfinding by generalized companion matrix pencils expressed in the Lagrange basis show that the method can sometimes be numerically stable. It has recently been proved that a new condition number, defined for points on a set containing the interpolation points, is never larger than the rootfinding condition number for the Bernstein polynomial ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Control

سال: 2010

ISSN: 0020-7179,1366-5820

DOI: 10.1080/00207179.2010.531397